coMPutation-FriendlY sHaPe graMMars Detailed by a sub-framework over parametric 2D rectangular shapes
نویسندگان
چکیده
NP-hardness of parametric subshape recognition for an arbitrary number of open terms is proven. Guided by this under standing of the complexity of subshape recognition, a framework for computation-friendly parametric shape grammar interpreters is proposed, which is further detailed by a sub-framework over parametric twodimensional rectangular shapes. As both the proof of NP-hardness and rectangular subframework invoke elements in graph theory, the relationship between shape and graph grammars is also explored. keywords: Parametric subshape recognition, NP-hard, graph grammar résumé : Il est démontré que la reconnaissance de sous-formes paramétriques pour un nombre arbitraire de termes ouverts est NP-difficile. En se basant sur cette analyse, nous proposons un cadre d’interpréteurs grammaticaux simples à calculer pour les formes paramétriques que nous détaillons davantage dans le cas de formes paramétriques rectangulaires bidimensionelles. Comme la preuve de NP-difficulté et notre sous-cas nécessitent des éléments de la théorie des graphes, nous explorons également la relation entre grammaires de formes et grammaires de graphes. mots-clés : Reconnaissance de sous-formes paramétriques, NP-difficulté, grammaires de graphes T. Tidafi and T. Dorta (eds) Joining Languages, Cultures and Visions: CAADFutures 2009 © puM, 2009 CAAD Futures 2009_compile.indd 757 27/05/09 10:47:15 758 K. Yue • r. KrisHnaMurti • f. GrobLer
منابع مشابه
From topologies to shapes: parametric shape grammars implemented by graphs
A method for implementing parametric shape grammars is presented. Subgraph detection is used to find subshapes. Parametric shapes are described by restricting topologies.
متن کاملShort Paper: View Dependent Rendering to Simple Parametric Display Surfaces
Computer displays have remained flat and rectangular for the most part. In this paper, we explore parametric display surfaces, which are of arbitrary shape, but with a mapping to a 2D domain for each pixel. The display could have arbitrary curved shapes given by implicit or parametric equations. We present a fast and efficient method to render 3D scenes onto such a display in a perspectively co...
متن کاملGRAPE: using graph grammars to implement shape grammars
An implementation of a shape grammar interpreter is described. The underlying graph-theoretic framework is briefly discussed to show how alternative representations from graph theory including graphs, overcomplete graphs and hyperedge graphs can support some of the intuitions handled in shape grammars by direct visual computations with shapes. The resulting plugin implemented in Rhino, code-nam...
متن کاملA Novel Toolbox for Generating Realistic Biological Cell Geometries for Electromagnetic Microdosimetry
Researchers in bioelectromagnetics often require realistic tissue, cellular and sub-cellular geometry models for their simulations. However, biological shapes are often extremely irregular, while conventional geometrical modeling tools on the market cannot meet the demand for fast and efficient construction of irregular geometries. We have designed a free, user-friendly tool in MATLAB that comb...
متن کاملOn curves and computation with shapes
Few computer implementations of shape grammars have been written that are applicable to curved shapes. The reason for this is that underlying representations of curves do not lend themselves to providing a unique description of curved shapes. Such a representation is essential for shape algorithms. This paper explains the problems posed in representing curves for shape grammar implementation. T...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009